Constrained via minimization
نویسندگان
چکیده
We show that the general two layer constrained via minimization problem and the three layer constrained via minimization problem for HVH topologies are NP-hard. A backtracking and a heuristic algorithm for the three layer HVH constrained via minimization problem are proposed. The backtracking algorithm can also be used for three layer non HVH problems. Experimental results indicate that our heuristic generally outperforms that of [CHAN89].
منابع مشابه
Voltage Stability Constrained OPF Using A Bilevel Programming Technique
This paper presents a voltage stability constrained optimal power flow that is expressed via a bilevel programming framework. The inner objective function is dedicated for maximizing voltage stability margin while the outer objective function is focused on minimization of total production cost of thermal units. The original two stage problem is converted to a single level optimization problem v...
متن کاملA chance-constrained multi-objective model for final assembly scheduling in ATO systems with uncertain sub-assembly availability
A chance-constraint multi-objective model under uncertainty in the availability of subassemblies is proposed for scheduling in ATO systems. The on-time delivery of customer orders as well as reducing the company's cost is crucial; therefore, a three-objective model is proposed including the minimization of1) overtime, idletime, change-over, and setup costs, 2) total dispersion of items’ deliver...
متن کاملAn Efficient Aopproach to Constrained Via Minimization for Two-Layer VLSI Routing
| Constrained Via Minimization is the problem of reassigning wire segments of a VLSI routing so that the number of vias is minimized. In this paper, a new approach is proposed for twolayer VLSI routing. This approach is able to handle any types of routing, and allows arbitrary number of wire segments split at a via candidate.
متن کاملVOLUME MINIMIZATION WITH DISPLACEMENT CONSTRAINTS IN TOPOLOGY OPTIMIZATION OF CONTINUUM STRUCTURES
In this paper, a displacement-constrained volume-minimizing topology optimization model is present for two-dimensional continuum problems. The new model is a generalization of the displacement-constrained volume-minimizing model developed by Yi and Sui [1] in which the displacement is constrained in the loading point. In the original model the displacement constraint was formulated as an equali...
متن کاملConstrained Discrete Optimization via Dual Space Search
This paper proposes a novel algorithm for solving NP-hard constrained discrete minimization problems whose unconstrained versions are solvable in polynomial time such as constrained submodular function minimization. Applications of our algorithm include constrained MAP inference in Markov Random Fields, and energy minimization in various computer vision problems. Our algorithm assumes the exist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. on CAD of Integrated Circuits and Systems
دوره 12 شماره
صفحات -
تاریخ انتشار 1993